%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : PUZ103^5 : TPTP v6.1.0. Bugfixed v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n111.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:28:59 EDT 2014

% Result   : Theorem 0.51s
% Output   : Proof 0.51s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : PUZ103^5 : TPTP v6.1.0. Bugfixed v5.2.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n111.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 08:19:01 CDT 2014
% % CPUTime  : 0.51 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x133a7e8>, <kernel.Constant object at 0x133ad88>) of role type named c1_type
% Using role type
% Declaring c1:fofType
% FOF formula (<kernel.Constant object at 0x13380e0>, <kernel.DependentProduct object at 0x10e1e60>) of role type named s_type
% Using role type
% Declaring s:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x133a7e8>, <kernel.DependentProduct object at 0x10e1e18>) of role type named cCKB6_NUM_type
% Using role type
% Declaring cCKB6_NUM:(fofType->Prop)
% FOF formula (((eq (fofType->Prop)) cCKB6_NUM) (fun (Xx:fofType)=> (forall (Xp:(fofType->Prop)), (((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))->(Xp Xx))))) of role definition named cCKB6_NUM_def
% A new definition: (((eq (fofType->Prop)) cCKB6_NUM) (fun (Xx:fofType)=> (forall (Xp:(fofType->Prop)), (((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))->(Xp Xx)))))
% Defined: cCKB6_NUM:=(fun (Xx:fofType)=> (forall (Xp:(fofType->Prop)), (((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))->(Xp Xx))))
% FOF formula (forall (Xx:fofType), ((cCKB6_NUM Xx)->(cCKB6_NUM (s Xx)))) of role conjecture named cCKB6_L3000
% Conjecture to prove = (forall (Xx:fofType), ((cCKB6_NUM Xx)->(cCKB6_NUM (s Xx)))):Prop
% We need to prove ['(forall (Xx:fofType), ((cCKB6_NUM Xx)->(cCKB6_NUM (s Xx))))']
% Parameter fofType:Type.
% Parameter c1:fofType.
% Parameter s:(fofType->fofType).
% Definition cCKB6_NUM:=(fun (Xx:fofType)=> (forall (Xp:(fofType->Prop)), (((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))->(Xp Xx)))):(fofType->Prop).
% Trying to prove (forall (Xx:fofType), ((cCKB6_NUM Xx)->(cCKB6_NUM (s Xx))))
% Found x30:=(x3 x0):(Xp Xx)
% Found (x3 x0) as proof of (Xp Xx)
% Found ((x Xp) x0) as proof of (Xp Xx)
% Found ((x Xp) x0) as proof of (Xp Xx)
% Found (x20 ((x Xp) x0)) as proof of (Xp (s Xx))
% Found ((x2 Xx) ((x Xp) x0)) as proof of (Xp (s Xx))
% Found (fun (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0))) as proof of (Xp (s Xx))
% Found (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0))) as proof of ((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->(Xp (s Xx)))
% Found (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0))) as proof of ((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->(Xp (s Xx))))
% Found (and_rect00 (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0)))) as proof of (Xp (s Xx))
% Found ((and_rect0 (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0)))) as proof of (Xp (s Xx))
% Found (((fun (P:Type) (x1:((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->P)))=> (((((and_rect (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))) P) x1) x0)) (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0)))) as proof of (Xp (s Xx))
% Found (fun (x0:((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))))=> (((fun (P:Type) (x1:((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->P)))=> (((((and_rect (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))) P) x1) x0)) (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0))))) as proof of (Xp (s Xx))
% Found (fun (Xp:(fofType->Prop)) (x0:((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))))=> (((fun (P:Type) (x1:((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->P)))=> (((((and_rect (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))) P) x1) x0)) (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0))))) as proof of (((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))->(Xp (s Xx)))
% Found (fun (x:(cCKB6_NUM Xx)) (Xp:(fofType->Prop)) (x0:((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))))=> (((fun (P:Type) (x1:((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->P)))=> (((((and_rect (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))) P) x1) x0)) (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0))))) as proof of (cCKB6_NUM (s Xx))
% Found (fun (Xx:fofType) (x:(cCKB6_NUM Xx)) (Xp:(fofType->Prop)) (x0:((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))))=> (((fun (P:Type) (x1:((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->P)))=> (((((and_rect (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))) P) x1) x0)) (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0))))) as proof of ((cCKB6_NUM Xx)->(cCKB6_NUM (s Xx)))
% Found (fun (Xx:fofType) (x:(cCKB6_NUM Xx)) (Xp:(fofType->Prop)) (x0:((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))))=> (((fun (P:Type) (x1:((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->P)))=> (((((and_rect (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))) P) x1) x0)) (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0))))) as proof of (forall (Xx:fofType), ((cCKB6_NUM Xx)->(cCKB6_NUM (s Xx))))
% Got proof (fun (Xx:fofType) (x:(cCKB6_NUM Xx)) (Xp:(fofType->Prop)) (x0:((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))))=> (((fun (P:Type) (x1:((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->P)))=> (((((and_rect (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))) P) x1) x0)) (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0)))))
% Time elapsed = 0.197461s
% node=53 cost=207.000000 depth=15
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (Xx:fofType) (x:(cCKB6_NUM Xx)) (Xp:(fofType->Prop)) (x0:((and (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))))=> (((fun (P:Type) (x1:((Xp c1)->((forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))->P)))=> (((((and_rect (Xp c1)) (forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw))))) P) x1) x0)) (Xp (s Xx))) (fun (x1:(Xp c1)) (x2:(forall (Xw:fofType), ((Xp Xw)->(Xp (s Xw)))))=> ((x2 Xx) ((x Xp) x0)))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------